On Prime Ends and Local Connectivity

نویسندگان

  • LASSE REMPE
  • Gerald Schmieder
چکیده

Let U ⊂ Ĉ be a simply connected domain whose complement K = Ĉ \ U contains more than one point. We show that the impression of a prime end of U contains at most two points at which K is locally connected. This is achieved by establishing a characterization of local connectivity of K at a point z0 ∈ ∂U in terms of the prime ends of U whose impressions contain z0 and then invoking a result of Ursell and Young [UY].

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Notes on some Distance-Based Invariants for 2-Dimensional Square and Comb Lattices

We present explicit formulae for the eccentric connectivity index and Wiener index of 2-dimensional square and comb lattices with open ends. The formulae for these indices of 2-dimensional square lattices with ends closed at themselves are also derived. The index for closed ends case divided by the same index for open ends case in the limit N →&infin defines a novel quantity we call compression...

متن کامل

A note on the order graph of a group

 The order graph of a group $G$, denoted by $Gamma^*(G)$, is a graph whose vertices are subgroups of $G$ and two distinct vertices $H$ and $K$ are adjacent if and only if $|H|big{|}|K|$ or $|K|big{|}|H|$. In this paper, we study the connectivity and diameter of this  graph. Also we give a relation between the order graph and prime  graph of a group.

متن کامل

ENERGY AWARE DISTRIBUTED PARTITIONING DETECTION AND CONNECTIVITY RESTORATION ALGORITHM IN WIRELESS SENSOR NETWORKS

 Mobile sensor networks rely heavily on inter-sensor connectivity for collection of data. Nodes in these networks monitor different regions of an area of interest and collectively present a global overview of some monitored activities or phenomena. A failure of a sensor leads to loss of connectivity and may cause partitioning of the network into disjoint segments. A number of approaches have be...

متن کامل

On generalisations of almost prime and weakly prime ideals

Let $R$ be a commutative ring with identity‎. ‎A proper ideal $P$ of $R$ is a $(n-1,n)$-$Phi_m$-prime ($(n-1,n)$-weakly prime) ideal if $a_1,ldots,a_nin R$‎, ‎$a_1cdots a_nin Pbackslash P^m$ ($a_1cdots a_nin Pbackslash {0}$) implies $a_1cdots a_{i-1}a_{i+1}cdots a_nin P$‎, ‎for some $iin{1,ldots,n}$; ($m,ngeq 2$)‎. ‎In this paper several results concerning $(n-1,n)$-$Phi_m$-prime and $(n-1,n)$-...

متن کامل

Directed prime graph of non-commutative ring

Prime graph of a ring R is a graph whose vertex set is the whole set R any any two elements $x$ and $y$ of $R$ are adjacent in the graph if and only if $xRy = 0$ or $yRx = 0$.  Prime graph of a ring is denoted by $PG(R)$. Directed prime graphs for non-commutative rings and connectivity in the graph are studied in the present paper. The diameter and girth of this graph are also studied in the pa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007